Eliciting a Suitable Voting Rule via Examples
نویسندگان
چکیده
We address the problem of specifying a voting rule by means of a series of examples. Each example consists of the answer to a simple question: how should the rule rank two alternatives, given the positions at which each voter ranks the two alternatives? To be able to formalise this elicitation problem, we develop a novel variant of classical social choice theory in terms of associations of alternatives with vectors of ranks rather than the common associations of voters with preference orders. We then define and study a class of voting rules suited for elicitation using such answers. Finally, we propose and experimentally evaluate several elicitation strategies for arriving at a good approximation of the target rule with a reasonable number of queries.
منابع مشابه
An Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack
Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...
متن کاملConsensual Decision-Making Without Voting The Constitutive Mechanism, (Informal) Institutionalisation and Democratic Quality of the Collective Decision Rule of ‘Tacit Consent’
Joint group decisions are very often achieved via a decision rule that is usually neglected in theory, though familiar to all of us from social settings and committee experiences: decision-making by ‘tacit consent’, i.e. by the absence of any open opposition. Widely known examples of its application in ‘High Politics’ are the Council of the European Union, the European Council or the World Trad...
متن کاملAutomated Design of Voting Rules by Learning from Examples
While impossibility results have established that no perfect voting rules exist, efficiently designing a voting rule that satisfies at least a given subset of desiderata remains a difficult task. We argue that such custom-built voting rules can be constructed by learning from examples. Specifically, we consider the learnability of the broad, concisely-representable class of scoring rules. Our m...
متن کاملAn improved approach for ranking the candidates in a voting system based on efficiency intervals
This paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. For this purpose, the advantage of a linear transformation is utilized to redene a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. Then, the best score of this virtual candidate is us...
متن کاملSome Remarks on Dodgson's Voting Rule
Sparked by a remarkable result due to Hemaspaandra et al. [1], the voting rule attributed to Charles Dodgson (aka Lewis Carroll) has become one of the most studied voting rules in computational social choice. However, the computer science literature often neglects that Dodgson’s rule has some serious shortcomings as a choice procedure. This short note contains four examples revealing Dodgson’s ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014